Optimal Multistage Switching Networks
ثبت نشده
چکیده
from that of Gaussian. It may be noted that this characteristic of pseudo-error detectors was predicted by G ~ o d i n g (~) and may now be regarded as being confirmed.' Scrutiny of Figures 8, 9 and 10 indicates that the achieved stability of the multiplication factor is sufficient to estimate BER from the pseudo-error rate with an accuracy of about a factor of 10 in BER. In addition, the estimate is performed on in service data in a very modest period of time. For example, the time required to accumulate 100 pseudo errors (more than adequate to obtain a high degree of confidence in the result) of a 1.544 Mbit/s transmission system operating a t lo-* BER when the pseudo error monitor has a lo5 multiplication factor at that BER is: Ne to = = 60 ms This expression was obtained from equations (1) and (7) with Ne = 100, B = 1.544. lo6 bits/s, BER= and pseudo-error detection gain G = lo5. The results of the testing on burst type interference show that a very high 'probability of burst detection can be achieved if the length of the phenomena causing the burst in the 1.544 Mbit/s data is greater than 40 ,us. This immediately suggests that in a system with two transmission channels available and a switch to select the superior that a combination of pseudo-error detectors and data buffers in each channel can be used to avoid errors. Note that some degree of error avoidance would be achieved even if the perturbation i s less than 40 ps in duration. In conclusion, it may be stated that the experimental testing carried out has confirmed the utility of the pseudo-error technique predicted in earlier theoretical papers.
منابع مشابه
A Systematic Analysis of Equivalence in Multi-Stage Networks
Many approaches to switching in optoelectronic and optical networks decompose the switching function across multiple stages or hops. This paper addresses the problem of determining whether two multi-stage or multi-hop networks are functionally equivalent. Various ad-hoc methods have been used in the past to establish such equivalences. A systematic method for determining equivalence is presente...
متن کاملOptimal All-to-All Personalized Exchange by Regularly Changing Switch States in Self-Routable Multistage Networks
Abstract-We find the permutation routing algorithm proposed by Lai [3] is closely related to the personalized exchange algorithm investigated by Yang and Wang [1] previously. Inspired by the idea of Lai, we modified Yang et al’s the personalized exchange algorithm in a pipelined version, and present a new switching pattern for reducing the changing speed of switching states by a half.
متن کاملRandomly-Wired Multistage Networks
Randomly-wired multistage networks have recently been shown to outperform traditional multistage networks in three respects. First, they have fast deterministic packet-switching and circuit-switching algorithms for routing permutations. Second, they are nonblocking, and there are on-line algorithms for establishing new connections in them, even if many requests for connections are made simultan...
متن کاملAnalysis of Shared Bu er Multistage Networks with Hot Spot
Multistage Interconnection Networks based on shared buuering are known to have better performance and buuer utilization than input or output buuered switches. Shared buuer switches do not suuer from head of line blocking which is a common problem in simple input buuering. Shared buuer switches have previously been studied under uniform and unbalanced traac patterns. However, due to the complexi...
متن کاملReplication and Reduction in Multistage Interconnection Networks
Multistage interconnection networks are conventionally composed of 2x2 switching elements which perform only permutation functions. A number of networks have been built which provide more powerful switch functions involving replication and reduction of information, including the NYU Ultracomputer and several copy networks. Here we investigate these machines as a group, to see how replication an...
متن کامل